TSTP Solution File: SYN983^1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : SYN983^1 : TPTP v8.2.0. Released v3.6.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% Computer : n013.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue May 21 08:43:55 EDT 2024
% Result : Theorem 0.20s 0.37s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 12
% Syntax : Number of formulae : 29 ( 9 unt; 11 typ; 0 def)
% Number of atoms : 160 ( 23 equ; 0 cnn)
% Maximal formula atoms : 3 ( 8 avg)
% Number of connectives : 30 ( 12 ~; 3 |; 11 &; 0 @)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 19 ( 18 >; 1 *; 0 +; 0 <<)
% Number of symbols : 15 ( 12 usr; 4 con; 0-6 aty)
% Number of variables : 6 ( 0 ^ 0 !; 0 ?; 6 :)
% ( 6 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
a: $o ).
thf(func_def_1,type,
b: $o ).
thf(func_def_2,type,
p: $o > $o ).
thf(func_def_6,type,
vAND: $o > $o > $o ).
thf(func_def_8,type,
kCOMB:
!>[X0: $tType,X1: $tType] : ( X0 > X1 > X0 ) ).
thf(func_def_9,type,
bCOMB:
!>[X0: $tType,X1: $tType,X2: $tType] : ( ( X1 > X2 ) > ( X0 > X1 ) > X0 > X2 ) ).
thf(func_def_10,type,
vOR: $o > $o > $o ).
thf(func_def_11,type,
vIMP: $o > $o > $o ).
thf(func_def_12,type,
vNOT: $o > $o ).
thf(func_def_13,type,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(f93,plain,
$false,
inference(trivial_inequality_removal,[],[f88]) ).
thf(f88,plain,
$true != $true,
inference(superposition,[],[f86,f9]) ).
thf(f9,plain,
vAPP($o,$o,p,a) = $true,
inference(cnf_transformation,[],[f8]) ).
thf(f8,plain,
( ( $true != vAPP($o,$o,p,vAPP($o,$o,vAPP($o,sTfun($o,$o),vAND,a),b)) )
& ( vAPP($o,$o,p,b) = $true )
& ( vAPP($o,$o,p,a) = $true ) ),
inference(flattening,[],[f7]) ).
thf(f7,plain,
( ( $true != vAPP($o,$o,p,vAPP($o,$o,vAPP($o,sTfun($o,$o),vAND,a),b)) )
& ( vAPP($o,$o,p,b) = $true )
& ( vAPP($o,$o,p,a) = $true ) ),
inference(ennf_transformation,[],[f6]) ).
thf(f6,plain,
~ ( ( ( vAPP($o,$o,p,b) = $true )
& ( vAPP($o,$o,p,a) = $true ) )
=> ( $true = vAPP($o,$o,p,vAPP($o,$o,vAPP($o,sTfun($o,$o),vAND,a),b)) ) ),
inference(fool_elimination,[],[f5]) ).
thf(f5,plain,
~ ( ( vAPP($o,$o,p,b)
& vAPP($o,$o,p,a) )
=> vAPP($o,$o,p,
( b
& a )) ),
inference(rectify,[],[f2]) ).
thf(f2,negated_conjecture,
~ ( ( vAPP($o,$o,p,b)
& vAPP($o,$o,p,a) )
=> vAPP($o,$o,p,
( b
& a )) ),
inference(negated_conjecture,[],[f1]) ).
thf(f1,conjecture,
( ( vAPP($o,$o,p,b)
& vAPP($o,$o,p,a) )
=> vAPP($o,$o,p,
( b
& a )) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',thm) ).
thf(f86,plain,
vAPP($o,$o,p,a) != $true,
inference(boolean_simplification,[],[f84]) ).
thf(f84,plain,
$true != vAPP($o,$o,p,vAPP($o,$o,vAPP($o,sTfun($o,$o),vAND,a),$true)),
inference(backward_demodulation,[],[f11,f72]) ).
thf(f72,plain,
b = $true,
inference(duplicate_literal_removal,[],[f70]) ).
thf(f70,plain,
( ( b = $true )
| ( b = $true ) ),
inference(binary_proxy_clausification,[],[f66]) ).
thf(f66,plain,
( ( b = $true )
| ( $true = vAPP($o,$o,vAPP($o,sTfun($o,$o),vAND,a),b) ) ),
inference(binary_proxy_clausification,[],[f65]) ).
thf(f65,plain,
b != vAPP($o,$o,vAPP($o,sTfun($o,$o),vAND,a),b),
inference(trivial_inequality_removal,[],[f59]) ).
thf(f59,plain,
( ( $true != $true )
| ( b != vAPP($o,$o,vAPP($o,sTfun($o,$o),vAND,a),b) ) ),
inference(constrained_superposition,[],[f11,f10]) ).
thf(f10,plain,
vAPP($o,$o,p,b) = $true,
inference(cnf_transformation,[],[f8]) ).
thf(f11,plain,
$true != vAPP($o,$o,p,vAPP($o,$o,vAPP($o,sTfun($o,$o),vAND,a),b)),
inference(cnf_transformation,[],[f8]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYN983^1 : TPTP v8.2.0. Released v3.6.0.
% 0.03/0.14 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.14/0.34 % Computer : n013.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Mon May 20 15:14:38 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.14/0.35 % (19165)Running in auto input_syntax mode. Trying TPTP
% 0.14/0.36 % (19169)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3:gsp=on:nm=4_470 on theBenchmark for (470ds/0Mi)
% 0.14/0.36 % (19169)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 0.14/0.36 % Exception at run slice level
% 0.14/0.36 User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.14/0.37 % (19166)fmb+10_1_fmbas=off:fmbsr=1.3:nm=2_1451 on theBenchmark for (1451ds/0Mi)
% 0.14/0.37 % (19167)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3_569 on theBenchmark for (569ds/0Mi)
% 0.14/0.37 % (19168)dis-2_2:3_amm=sco:anc=none:bce=on:fsr=off:gsp=on:nm=16:nwc=1.2:nicw=on:sac=on:sp=weighted_frequency_476 on theBenchmark for (476ds/0Mi)
% 0.14/0.37 % (19171)dis+11_4:5_nm=4_216 on theBenchmark for (216ds/0Mi)
% 0.14/0.37 % (19170)dis+1_20_av=off:lcm=predicate:nm=2:nwc=2.0_396 on theBenchmark for (396ds/0Mi)
% 0.14/0.37 % (19172)fmb+10_1_fmbas=off:fmbsr=1.3:nm=2:si=on:rtra=on:rawr=on:rp=on:fmbksg=on_1451 on theBenchmark for (1451ds/0Mi)
% 0.20/0.37 % (19168)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 0.20/0.37 % Exception at run slice level
% 0.20/0.37 User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.20/0.37 % Exception at run slice level
% 0.20/0.37 User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.20/0.37 % Exception at run slice level
% 0.20/0.37 User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.20/0.37 % (19168)First to succeed.
% 0.20/0.37 % (19171)Also succeeded, but the first one will report.
% 0.20/0.37 % (19170)Also succeeded, but the first one will report.
% 0.20/0.37 % (19168)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-19165"
% 0.20/0.37 % (19168)Refutation found. Thanks to Tanya!
% 0.20/0.37 % SZS status Theorem for theBenchmark
% 0.20/0.37 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.37 % (19168)------------------------------
% 0.20/0.37 % (19168)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.20/0.37 % (19168)Termination reason: Refutation
% 0.20/0.37
% 0.20/0.37 % (19168)Memory used [KB]: 774
% 0.20/0.37 % (19168)Time elapsed: 0.005 s
% 0.20/0.37 % (19168)Instructions burned: 5 (million)
% 0.20/0.37 % (19165)Success in time 0.018 s
%------------------------------------------------------------------------------